Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Paolo Boldi and Sebastiano Vigna. Kings, Name Days, Lazy Servants and Magic. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boldi_et_al:LIPIcs.FUN.2018.10, author = {Boldi, Paolo and Vigna, Sebastiano}, title = {{Kings, Name Days, Lazy Servants and Magic}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.10}, URN = {urn:nbn:de:0030-drops-88017}, doi = {10.4230/LIPIcs.FUN.2018.10}, annote = {Keywords: Suffix trees, suffix arrays, z-fast tries, prefix search} }
Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)
Paolo Boldi, Massimo Santini, and Sebastiano Vigna. A Deeper Investigation of PageRank as a Function of the Damping Factor. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{boldi_et_al:DagSemProc.07071.3, author = {Boldi, Paolo and Santini, Massimo and Vigna, Sebastiano}, title = {{A Deeper Investigation of PageRank as a Function of the Damping Factor}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.3}, URN = {urn:nbn:de:0030-drops-10722}, doi = {10.4230/DagSemProc.07071.3}, annote = {Keywords: PageRank, damping factor, Markov chains} }
Published in: Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007)
Sebastiano Vigna. Stanford Matrix Considered Harmful. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{vigna:DagSemProc.07071.15, author = {Vigna, Sebastiano}, title = {{Stanford Matrix Considered Harmful}}, booktitle = {Web Information Retrieval and Linear Algebra Algorithms}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7071}, editor = {Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.15}, URN = {urn:nbn:de:0030-drops-10587}, doi = {10.4230/DagSemProc.07071.15}, annote = {Keywords: Weg graph, PageRank, HITS} }
Feedback for Dagstuhl Publishing